Monotonicity preservation on triangles

نویسندگان

  • Michael S. Floater
  • Juan Manuel Peña
چکیده

It is well known that Bernstein polynomials on triangles preserve monotonicity. In this paper we define and study three kinds of monotonicity preservation of systems of bivariate functions on a triangle. We characterize and compare several of these systems and derive some geometric applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L-minimization Methods for Hamilton-jacobi Equations: the One-dimensional Case

The goal of the present paper is to investigate the approximation properties of a new class of L-minimization techniques for approximating stationary HamiltonJacobi equations in one space dimension. Most approximation algorithms of Hamilton-Jacobi equations are based on monotonicity and Lax-Friedrichs approximate Hamiltonians, see e.g. Kao, Osher, and Tsai [13]. Monotonicity is very often invok...

متن کامل

Tensor-product monotonicity preservation

The preservation of surface shape is important in geometric modelling and approximation theory. In geometric modelling one would like to manipulate the shape of the surface being modelled by the simpler task of manipulating the control points. In scattered data approximation one might wish to approximate bivariate data sampled from a function with a shape property by a spline function sharing t...

متن کامل

Selective monotonicity preservation in scalar advection

An efficient method for scalar advection is developed that selectively preserves monotonicity. Monotonicity preservation is applied only where the scalar field is likely to contain discontinuities as indicated by significant grid-cell-to-grid-cell variations in a smoothness measure conceptually similar to that used in weighted essentially non-oscillatory (WENO) methods. In smooth regions, the n...

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

Similar Triangles, Another Trace of the Golden Ratio

In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2000